Method and apparatus for transmitting and receiving data in a communication system

ABSTRACT

A method is provided for transmitting data, which improves a diversity effect in a communication system. The method includes transmitting an information word including a codeword in a (k+s)-th frame, generating s groups based on parity bits obtained by encoding the information word, and transmitting the s groups in s frames preceding the (k+s)-th frame, in a distributed manner.

PRIORITY

This application claims priority under 35 U.S.C. §119(a) to Korean Patent Applications filed in the Korean Intellectual Property Office on Nov. 18, 2009, Dec. 3, 2009, Jan. 6, 2010, and Nov. 12, 2010, which were assigned Serial Nos. 10-2009-0111489, 10-2009-0119207, 10-2010-0001007, and 10-2010-0112601, respectively, the entire disclosures of all of which are hereby incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to a communication system, and more particularly, to a transmission and reception method and apparatus for obtaining diversity effects.

2. Description of the Related Art

In wireless communication systems, link performances significantly degrade from various noises and fading of channels, and Inter-Symbol Interference (ISI). Therefore, to realize high-speed digital communication systems providing high data throughput and reliability, such as a next-generation mobile communication system, a digital broadcasting system, and a mobile Internet system, it is important to develop technologies for coping with noise, fading, and ISI. Recently, error-correcting codes have been studied to improve communication reliability by efficiently restoring information distortion.

A Low-Density Parity Check (LDPC) code, which was first introduced in the 1960s, was never commonly implemented due to its implementation complexity far exceeding the then current technology. However, as a turbo code, which was discovered in 1993, shows performance close to the Shannon's channel capability, many studies have been conducted on iterative decoding and graph-based channel encoding, along with many interpretations that have been made on the performance and characteristics of the turbo code. Upon this opportunity, the LDPC code was restudied in late 1990s, proving that the LDPC code also has performance close to Shannon's channel capacity, if decoded by sum-product algorithm-based iterative decoding on a Tanner graph (a specific case of a factor graph) corresponding to the LDPC code.

The LDPC code is commonly defined by a parity check matrix, and can be represented using a bipartite graph called a Tanner graph. An LDPC code is used to generate a codeword including N_(ldpc) bits or symbols by receiving and LDPC-encoding an information word including K_(ldpc) bits or symbols. For convenience of description, only a codeword including N_(ldpc) bits, generated by receiving and LDPC-encoding an information word including K_(ldpc) bits will be considered herein. That is, a codeword c=[c₀, c₁, c₂, c₃, . . . , c_(N) _(ldpc) ⁻¹] is generated by receiving and LDPC-encoding an information word I={i₀, i₁, i₂, . . . , i_(K) _(ldpc) ⁻¹} including K_(ldpc) input bits. That is, the codeword is a bit stream including a plurality of bits, and codeword bits are the bits of the codeword. Similarly, the information word is a bit stream including a plurality of bits, and information bits are the bits of the information word.

For a systematic code, a codeword is generated as c=[c₀, c₁, c₂, c₃, . . . , c_(N) _(ldpc) ⁻¹]=[i₀, i₁, . . . , i_(K) _(ldpc) ⁻¹, p₀, p₁, . . . , p_(N) _(ldpc) ⁻¹], where P=[p₀, p₁, . . . , p_(N) _(ldpc) ⁻¹] represents parity bits, and the number of parity bits is N_(parity)=N_(ldpc)−K_(ldpc).

Because the TLPC code is defined by a parity check matrix, a sequence c satisfying Equation (1) becomes a codeword for an LDPC code.

H·c ^(T)=0  (1)

In Equation (1), c=[c₀, c₁, c₂, c₃, . . . , c_(N) _(ldpc) ⁻¹]. The parity check matrix H includes N_(ldpc) columns, and means that an i-th column is associated with an i-th codeword bit c₁.

As indicated above, an LDPC code may be represented by a bipartite graph based on a parity check matrix. The bipartite graph means that vertexes constituting the graph are divided into two different types. The LDPC code is represented by a bipartite graph including N_(ldpc) vertexes, which are called variable nodes and check nodes. The variable nodes correspond to encoded bits on a one-to-one basis, meaning that an i-th variable node corresponds to an i-th codeword bit.

FIG. 1 illustrates an example of a parity check matrix H of an LDPC code including four rows and eight columns.

Referring to FIG. 1, the parity check matrix H generates a length-8 LDPC codeword because it has eight columns, which correspond to eight encoded bits, respectively.

FIG. 2 illustrates a Tanner graph corresponding to the parity check matrix H as illustrated in FIG. 1.

Referring to FIG. 2, the Tanner graph of the LDPC code includes eight variable nodes x₀ 202, x₁ 204, x₂ 206, x₃ 208, x₄ 210, x₅ 212, x₆ 214, and x₇ 216, and four check nodes 218, 220, 222, and 224. An i-th column and a j-th row in the parity check matrix H of the LDPC code correspond to an i-th variable node x₁ and a j-th check node, respectively. In addition, a value of 1, i.e., a non-zero value, in the point where an i-th column and a j-th row cross in the parity check matrix H of the LDPC code means that an edge exists between the i-th variable node x₁ and the j-th check node on the Tanner graph as illustrated in FIG. 2.

Generally, an LDPC code is decoded using a Tanner graph. That is, variable nodes and check nodes generate messages, and exchange the messages through their edges, thereby performing iterative decoding. Therefore, there are correlations between variable nodes connected to one check node, and the correlations should be considered during shortening and puncturing.

In the Tanner graph of the LDPC code, degrees of variable nodes and check nodes indicate the number of edges connected thereto, and are identical to the number of non-zero entries in columns or rows corresponding to their nodes in the parity check matrix of the LDPC code. For example, in FIG. 2, degrees of variable nodes x₀ 202, x₁ 204, x₂ 206, x₃ 208, x₄ 210, x₅ 212, x₆ 214, and x₇ 216 are 4, 3, 3, 3, 2, 2, 2, and 2, respectively, and degrees of check nodes 218, 220, 222, and 224 are 6, 5, 5, and 5, respectively. The numbers of non-zero entries in columns in the parity check matrix H of FIG. 1, which correspond to the variable nodes in FIG. 2, are also 4, 3, 3, 3, 2, 2, 2, and 2, respectively, and the numbers of non-zero entries in rows in the parity check matrix H of FIG. 1, which correspond to the check nodes in FIG. 2, are also 6, 5, 5, and 5, respectively. The variable nodes correspond to codeword bits on a one-to-one basis. Therefore, if an i-th variable node corresponds to an i-th codeword bit on a one-to-one basis, a degree of an i-th variable node can be considered as a degree of an i-th codeword bit.

The density of ‘1’ decreases with an increase in N_(ldpc) in the parity check matrix. Generally, because the density of non-zero entries for an LDPC code is inversely proportional to the codeword length N_(ldpc), an LDPC code with a large value for N_(ldpc) has a very low density. The use of “low density” in the name of the LDPC code was derived from this principle.

Because an LDPC code is defined by a parity check matrix, a system stores the parity check matrix in order to apply the LDPC code. Generally, to store an LDPC code, position information of a weight of 1 in the parity check matrix is stored. However, because a codeword length of an LDPC code used in an actual system ranges from hundreds of bits to hundreds of thousands of bits, a memory required to store the position information of a weight of 1 is very large in capacity if the codeword length of the LDPC code is very long.

To overcome these shortcomings, many studies have been conducted on various LDPC codes having specific structures. For an LDPC code having a specific structure, because positions of a weight of 1 are limited in its parity check matrix according to a specific condition, the positions of a weight of 1 can be stored more efficiently.

FIG. 3 illustrates an example of an LDPC code having a specific structure. It is assumed herein that an LDPC code has a systematic structure, in which a codeword includes an information word.

Referring to FIG. 3, the parity check matrix includes an information part (or information word part) and a parity part. The information part includes K_(ldpc) columns, and the parity part includes N_(parity)=N_(ldpc)−K_(ldpc) columns. The number of rows in the parity check matrix is N_(ldpc)−K_(ldpc), which is the same as the number of columns in the parity part.

Here, N_(ldpc) represents a length of an LDPC codeword, K_(ldpc) represents a length of an information word, and N_(ldpc)−K_(ldpc) represents a length of a parity part. The length of a codeword refers to the number of bits included in the codeword. Similarly, the length of an information word refers to the number of bits included in the information word. In addition, integers M and Q_(ldpc) are determined to meet

${Q_{ldpc} = \frac{\left( {N_{ldpc} - K_{ldpc}} \right)}{M}},$

and

$\frac{K_{ldpc}}{M}$

is also an integer. M and Q_(ldpc) are subject to change according to the codeword length and the code rate.

In the parity check matrix illustrated in FIG. 3, positions of a weight of 1 in a K_(ldpc)-th column to an (N_(ldpc)−1)-th column, which is a part corresponding to the parity bits, have a dual diagonal structure. Therefore, it is noted that degrees of columns corresponding to the parity bits are all 2, except for a degree of the (N_(ldpc)−1)-th column, which is 1.

Referring to FIG. 3, in the parity check matrix, a structure of a 0-th column to a (K_(ldpc)−1)-th column, i.e., a part corresponding to an information word, can be made according to the following rules.

Rule 1: In the parity check matrix, a total of

$\frac{K_{ldpc}}{M}$

column groups are generated by grouping K_(ldpc) columns corresponding to an information word on an M-column basis. Columns in each column group are generated according to Rule 2 below.

Rule 2: Positions of 1 in a 0-th column in an i-th

$\left( {{i = 1},\ldots \mspace{14mu},\frac{K_{ldpc}}{M}} \right)$

column group are determined. Assuming that a degree of a 0-th column in each i-th column group is represented by D₁, if positions of rows with 1 are R_(i,0) ⁽¹⁾R_(i,0) ⁽²⁾, . . . , R_(i,0) ^((D) ^(i)) , then positions R_(i,0) ^((k))(k=1, 2, . . . , D_(i)) of rows with 1 in a j-th (j=1, 2, . . . , M−1) column in an i-th column group are defined as shown in Equation (2) below.

$\begin{matrix} {{R_{i,j}^{(k)} = {R_{i,j}^{(k)} + {q\; {{mod}\left( {N_{ldpc} - K_{ldpc}} \right)}}}}{{k = 1},2,\ldots \mspace{14mu},D_{i},{i = 1},\ldots \mspace{14mu},\frac{K_{ldpc}}{M},{j = 1},\ldots \mspace{14mu},{M - 1}}} & (2) \end{matrix}$

According to Rules 1 and 2, degrees of columns in an i-th

$\left( {{i = 1},\ldots \mspace{14mu},\frac{K_{ldpc}}{M}} \right)$

column group are all equal to D₁.

A more detailed example will be described below for a better understanding of a structure of an LDPC code that stores information about the parity check matrix according to above rules. In the following detailed example, for N_(ldpc)=30, K_(ldpc)=15, M=5, and Q_(ldpc)=3, position information of rows with 1 in a 0-th column in each of three column groups may be represented in sequences called “weight-1 position sequences”, as shown below.

R_(1, 0)⁽¹⁾ = 1,  R_(1, 0)⁽²⁾ = 2,  R_(1, 0)⁽³⁾ = 8,  R_(1, 0)⁽⁴⁾ = 10, R_(2, 0)⁽¹⁾ = 0,  R_(2, 0)⁽²⁾ = 9,  R_(2, 0)⁽³⁾ = 13, R_(3, 0)⁽¹⁾ = 0,  R_(3, 0)⁽²⁾ = 14.

For convenience, only the weight-1 position sequences for positions of rows with 1 in a 0-th column in each column group are represented on a column group basis, as shown below.

$\begin{matrix} 1 & 2 & 8 & 10 \\ 0 & 9 & 13 & \; \\ 0 & 14 & \; & \; \end{matrix}$

That is, the i-th weight-1 position sequence sequentially represents position information of rows with 1 in an i-th column group.

An LDPC code achieves encoding and decoding for a given number K_(ldpc) of information bits and a given number N_(ldpc) of codeword bits. The number N_(parity) of parity bits is N_(ldpc)−K_(ldpc). If the given number K_(ldpc) of information bits is greater than the number K₁ of information bits being input to an encoder, the information bits undergo shortening by K_(ldpc)−K₁ before being transmitted. In addition, if the required number N_(tx-parity)=N_(tx) _(—) _(ldpc)−K₁ of parity bits is less than the number N_(parity) of parity bits, the parity bits undergo puncturing by N_(parity)−N_(tx-parity) before being transmitted. The N_(tx-parity) represents a length of parity bits actually used, and can be calculated based on the length K₁ of the input information word and the code rate for transmission. As the actual operations of shortening and puncturing are not directly related to the embodiment of the present invention that will be described below, detailed descriptions of the shortening and puncturing are omitted.

In some cases, when carrying encoded data, Additive White Gaussian Noise (AWGN) channels may ensure very good performance, but fading channels may fail to obtain sufficient diversity. Therefore, a method capable of overcoming this problem is required.

FIG. 4 illustrates OFDM frames in a on a Digital Video Broadcasting the 2nd Generation Terrestrial (DVB-T2) system and a Digital Video Broadcasting Next Generation Handheld (DVB-NGH) system.

Referring to FIG. 4, a plurality of frames each include a plurality of OFMD symbols. One frame includes a P1/P2 symbol part and a data part. Signaling information is mapped to the P1/P2 symbol part, and the mapped information is transmitted on the P1/P2 symbol part. Data other than the signaling information is mapped to the data part, and the mapped data is transmitted on a plurality of OFDM symbols. Accordingly, the data signals are transmitted on a plurality of frames, making it possible to obtain sufficient diversity gain. However, the signaling information cannot obtain sufficient diversity gain, which leads to performance degradation.

SUMMARY OF THE INVENTION

Accordingly, the present invention is designed to address at least the above-described problems and/or disadvantages and to provide at least the advantages described below.

An aspect of the present invention is to provide a method and apparatus for transmitting data with sufficient diversity gain.

Another aspect of the present invention is to provide a method and apparatus for generating parity groups with sufficient diversity gain.

In accordance with an aspect of the present invention, a method is provided for transmitting data in a communication system. The method includes transmitting an information word included in a codeword on a (k+s)-th frame; generating s groups based on parity bits obtained by encoding the information word; and transmitting the s groups on s frames preceding the (k+s)-th frame in a distributed manner.

In accordance with another aspect of the present invention, a method is provided for transmitting data in a communication system. The method includes preferentially transmitting, on a (k+s)-th frame, an information word included in a codeword and remaining bits except for bits punctured according to a predetermined puncturing pattern among parity bits obtained by encoding the information word; generating s groups by selecting the punctured bits in sequence according to the puncturing pattern or in reverse order of the puncturing pattern; and transmitting the s groups on s frames preceding the (k+s)-th frame in a distributed manner.

In accordance with another aspect of the present invention, an apparatus is provided for transmitting data in a communication system. The apparatus includes an encoder for encoding an information word according to a predetermined method; a puncturer for puncturing, according to a predetermined puncturing pattern, a codeword encoded by the encoder; a parity group generator for generating s groups by preferentially selecting parity bits punctured by the puncturer in the codeword output from the encoder; and a transmitter for transmitting an information word included in the codeword and groups of the parity bits on a (k+s)-th frame and s frames preceding the (k+s)-th frame in a distributed manner, respectively.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features, and advantages of certain embodiments of the present invention will be more apparent from the following description taken in conjunction with the accompanying drawings, in which:

FIG. 1 illustrates a parity check matrix of a length-8 LDPC code;

FIG. 2 illustrates a Tanner graph corresponding to a parity check matrix of a length-8 LDPC code;

FIG. 3 illustrates a parity check matrix of an LDPC code used in a DVB-T2 system;

FIG. 4 illustrates a frame structure in a form for a DVB-T2/NGH system;

FIG. 5 illustrates a frame structure based on Rule 3 according to an embodiment of the present invention;

FIG. 6 illustrates parity bits included in Q_(ldpc) groups according to an embodiment of the present invention;

FIG. 7 illustrates a frame structure based on Rule 4 according to an embodiment of the present invention;

FIGS. 8A to 8C illustrate frame structures based on Rule 5 according to an embodiment of the present invention;

FIG. 9 illustrates a frame structure of a DVB-T2/NGH system according to an embodiment of the present invention;

FIG. 10 illustrates a frame structure of a DVB-T2/NGH system according to another embodiment of the present invention;

FIG. 11 illustrates a frame structure of a DVB-T2/NGH system according to another embodiment of the present invention;

FIGS. 12 to 14 are diagrams illustrating methods of selecting additional parity bits according to different embodiments of the present invention;

FIG. 15 is a block diagram illustrating a transmission and reception apparatus according to an embodiment of the present invention;

FIG. 16 is a block diagram illustrating a transmission apparatus according to an embodiment of the present invention;

FIG. 17 is a block diagram illustrating a reception apparatus according to an embodiment of the present invention;

FIG. 18 is a block diagram illustrating a transmission apparatus according to an embodiment of the present invention;

FIG. 19 is a block diagram illustrating a reception apparatus according to an embodiment of the present invention;

FIG. 20 is a flowchart illustrating a transmission method according to an embodiment of the present invention;

FIG. 21 is a flowchart illustrating a reception method according to an embodiment of the present invention;

FIGS. 22A and 22B are diagrams illustrating various frame structures according to different embodiments of the present invention; and

FIG. 23 is a diagram illustrating a method for selecting additional parity bits according to an embodiment of the present invention.

Throughout the drawings, the same drawing reference numerals will be understood to refer to the same elements, features and structures.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Various embodiments of the present invention will be described in detail below with reference to the accompanying drawings. In the following description, specific details such as detailed configuration and components are provided merely to assist in an overall understanding of the described embodiments of the present invention. Therefore, it should be apparent to those skilled in the art that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

Additionally, while detailed descriptions of the present invention will be made based on a DVB-T2 system and a DVB-NGH system, which are typical European digital broadcasting standards, it will be understood by those of ordinary skill in the art that the present invention is not limited to these systems. In addition, while the present invention will be described in conjunction with a method of transmitting signaling information, the present invention is not limited to transmission of the signaling information.

The codeword described below include two parts, i.e., a first part, which is an information part including actual information words, and a second part, which is a parity part including additional information obtained by receiving and encoding information words. As described above, if needed, a codeword can be created from data by puncturing and shortening.

For convenience of description, it is assumed herein that the term ‘codeword’ refers to all of an information word and parity bits obtained by encoding the information word. That is, the parity bits include both non-punctured parity bits and punctured parity bits.

If sufficient diversity gain cannot be obtained during transmission of the codeword, an additional diversity gain may be obtained by transmitting data on a plurality of frames.

Method 1

Information words are transmitted in a z-th frame, and additional parity bits are created based on information word and parity bits, which can be obtained by encoding information words. The additional parity bits are transmitted over s frames. Groups of additional parity bits transmitted in associated frames are represented by G(0), G(1), . . . , G(s−1), and the numbers of bits in the groups are N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , . . . , N_(add) _(—) _(parity) _(s-1) . The additional parity bits are grouped according to specific rules.

The term “additional parity bits” refers to parity bits that are transmitted on frames different from those of information words, separate from the parity bits that are transmitted on the same frames as those of the information words.

As described above, a code is generated based on an (N_(ldpc), K_(ldpc)) code. Accordingly, a puncturing pattern of parity bits, suitable for the code, can be calculated. However, a detailed description of a method for calculating a puncturing pattern will be omitted so as not to obscure the subject matter of the present invention.

The term “puncturing pattern of parity bits” refers to an order of indexes of punctured parity bits. That is, if the number of punctured parity bits is N_(punc)=2, then N_(punc)=2 elements are sequentially selected in the puncturing pattern and parity bits having the selected values as their indexes are punctured. Assuming that a puncturing pattern set, or a puncturing order, is A={1, 5, 2, 6, 4, 0, 3, 7}, if the number of punctured parity bits is 2, then two indexes 1 and 5 are sequentially selected in the puncturing pattern set A. As a result, p₁ and p₅ are punctured from the parity bits p₀, p₁, p₂, p₃, p₄, p₅, p₆, and p₇, and the remaining parity bits p₀, p₂, p₃, p₄, p₆, and p₇ are selected as a parity part and transmitted.

For the information word and parity bits, additional parity bits can be created using Rule 3, as described below.

Rule 3

Additional parity bits may be selected from among parity bits and information bits. An order of selecting additional parity bits from the parity bits is based on a puncturing order. In this case, either a normal order or a reverse order of the puncturing pattern may be used. Otherwise, additional parity bits are selected from information bits, and information bits capable of guaranteeing excellent performance are selected in order.

Generally, bits concatenated in an order of a puncturing pattern are created to have a low correlation. That is, the order of the puncturing pattern is determined such that even though both of two concatenated bits suffer from deep fading and are not easily restored, the restoration may be easily achieved by using other bits. For example, when bits concatenated in a normal order or a reverse order of the puncturing pattern are mapped to the same groups and transmitted on the same frames, even though all the frames suffer from deep fading, the restoration may be easily achieved by other parity bits. Therefore, the restoration may be easily achieved by selecting additional parity bits in the normal order or the reverse order of the puncturing pattern as in Rule 3.

In Rule 3, additional parity bits may be created by first determining an order of remaining bits, except for the punctured bits, and then selecting the punctured bits after selecting the non-punctured bits.

In Rule 3, when additional parity bits are selected after the punctured bits are all selected, bits capable of guaranteeing excellent performance may be selected from among information bits and parity bits using a greedy algorithm. The greedy algorithm selects the best performance bits among the codeword bits when primarily selecting additional parity bits, and selects the best performance bits among the remaining bits, with the first selected bits fixed as previously selected bits, when secondarily selecting additional parity bits. The following should be considered in selecting high-performance bits.

1) Degrees of variable nodes corresponding to codeword bits

2) Minimum cycles of variable nodes corresponding to codeword bits

3) Bit Error Rate (BER) performance of codeword bits

While two embodiments of selecting additional parity bits using the greedy algorithm will be described below, various other methods are also available.

Additionally, the following descriptions assume that the numbers of elements in groups of additional parity bits are N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , . . . , N_(add) _(—) _(parity) _(s-1) , and a sum of these values is N_(total)=N_(add) _(—) _(parity) ₀ + . . . +N_(add) _(—) _(parity) _(s-1) .

Embodiment 1

N _(total) =N _(add) _(—) _(parity) ₀ + . . . +N _(add) _(—) _(parity) _(s-1) <N _(ldpc) −K _(ldpc)

If a length of a parity part is greater than a sum of the numbers of elements in groups of additional parity bits, groups of additional parity bits are created based on parity bits of a codeword according to order of a puncturing pattern.

FIG. 5 illustrates a frame structure based on Rule 3 according to an embodiment of the present invention.

Referring to FIG. 5, a codeword includes an information part and a parity part. As an example, in FIG. 7, a length of the information part, after undergoing shortening, is 7 bits, I={i₀, i₁, . . . , i₆}, the parity part is 8 bits in length, P={p₀, p₁, p₂, . . . , p₇}, and a puncturing pattern set representing puncturing order is A={1, 5, 2, 6, 4, 0, 3, 7}.

For N_(punc)=2, s=3, and N_(add) _(—) _(parity) ₀ =N_(add) _(—) _(parity) ₁ =N_(add) _(—) _(parity) ₂ =2 (where N_(punc) is the number of punctured bits, s is the number of frames on which additional parity bits are transmitted, and N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , and N_(add) _(—) _(parity) ₂ are the numbers of additional parity bits transmitted on their associated frames), groups of additional parity bits are created as follows.

Because the number of punctured bits is 2, p₁ and p₅ are punctured according to the puncturing pattern set A.

Because elements included in groups of additional parity bits are determined from among the bits p₀, p₂, p₃, p₄, p₆, and p₇, not the punctured bits p₁ and p₅, according to the normal puncturing order, a first group is G(0)={p₂, p₆}, a second group is G(1)={p₄, p₀}, and a third group is G(2)={p₃, p₇}. The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame.

Conversely, if elements included the groups of the additional parity bits are determined from the bits, except for the punctured bits, according to the reverse puncturing order, a first group is G(0)={p₇, p₃}, a second group is G(1)={p₀, p₄}, and a third group is G(2)={p₆, p₂}. The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame.

While the determined groups are sequentially transmitted, the transmission order of the groups is subject to change.

Embodiment 2

N _(total) =N _(add) _(—) _(parity) ₀ + . . . +N _(add) _(—) _(parity) _(s-1) <N _(ldpc) −K _(ldpc)

If a length of a parity part is less than or equal to a sum of the numbers of elements in groups of additional parity bits, groups of additional parity bits are created based on parity bits and information bits of a codeword.

Again, a codeword includes an information part and a parity part. Using the same example as above, a length of the information part, after undergoing shortening, is 7 bits, I={i₀, i₁, . . . , i₆}, the parity part is 8 bits in length and is P={p₀, p₁, p₂, . . . , p₇}, and a puncturing pattern set representing puncturing order is A={1, 5, 2, 6, 4, 0, 3, 7}.

For N_(punc)=2, s=3, and N_(add) _(—) _(parity) ₀ =N_(add) _(—) _(parity) ₁ =N_(add) _(—) _(parity) ₂ 32 3 (where N_(punc) is the number of punctured bits, s is the number of frames on which additional parity bits are transmitted, and N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , and N_(add) _(—) _(parity) ₂ are the numbers of additional parity bits transmitted on their associated frames), groups of additional parity bits are created as follows.

Because the number of punctured bits is 2, p₁ and p₅ are punctured according to the puncturing pattern set A.

Because elements included groups of additional parity bits are determined according to the normal puncturing order, a first group is G(0)={p₂, p₆, p₄}, a second group is G(1)={p₀, p₃, p₇}, and a third group is G(2)={p₁, p₅, i₀}. Notably, the third group includes the parity bits p₁ and p₅, which were previously punctured, and one bit i₀ from among the codeword bits. The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame.

Conversely, if the elements included in the groups of the additional parity bits are determined according to the reverse puncturing order, a first group is G(0)={p₇, p₃, p₀}, a second group is G(1)={p₄, p₆, p₂}, and a third group is G(2)={p₅, p₁, i₀}. Likewise, the third group includes the parity bits p₅ and p₁, which were previously punctured, and one bit i₀ among the codeword bits. The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame.

While the determined groups are sequentially transmitted, the transmission order of the groups is subject to change.

A method for generating a plurality of groups of additional parity bits based on information bits and parity bits in accordance with Rule 3 will be described in more detail below.

For the parity check matrix of an LDPC code illustrated in FIG. 3, having a codeword length of N_(ldpc) and an information word length K_(ldpc), the parity bits can be represented as {p₀, p₁, . . . , p_(N1dpc-Kldpc-1)} and Q_(ldpc) groups of parity bits can be generated.

FIG. 6 illustrates parity bits included in Q_(ldpc) groups according to an embodiment of the present invention.

An index group representing index values of parity bits included in a j-th group from among the Q_(ldpc) groups can be expressed as shown in Equation (3) below.

I(j)={k|k mod Q _(ldpc) =j,0≦k<N _(ldpc) −K _(ldpc)} for 0≦j<Q _(ldpc)  (3)

Based on Equation (3), an index group of parity bits for a puncturing pattern representing the puncturing order can be calculated as shown in Equation (4) below.

A _(360×j+i) I _(i)(π_(p)(j)) for 0≦i<359, 0≦j<Q _(ldpc)  (4)

That is, a (360×j+i)-th element in a puncturing pattern set A, which indicates a puncturing order, is the same as an i-th element in an I(π(j)) index group. π(j) for 0≦j<Q_(ldpc) is defined as Table 1 below.

TABLE 1 Order of parity group to be punctured, {π_(P)(j), 0 d j < Q_(ldpc) = 25} Modulation π_(P)(0) π_(P)(1) π_(P)(2) π_(P)(3) π_(P)(4) π_(P)(5) π_(P)(6) π_(P)(7) π_(P)(8) π_(P)(9) π_(P)(10) π_(P)(11) π_(P)(12) and Code rate π_(P)(13) π_(P)(14) π_(P)(15) π_(P)(16) π_(P)(17) π_(P)(18) π_(P)(19) π_(P)(20) π_(P)(21) π_(P)(22) π_(P)(23) π_(P)(24) — BPSK/ 1/2 6 4 18 9 13 8 15 20 5 17 2 24 10 QPSK 22 12 3 16 23 1 14 0 21 19 7 11 — 16-QAM 1/2 6 4 13 9 18 8 15 20 5 17 2 22 24 7 12 1 16 23 14 0 21 10 19 11 3 — 64-QAM 1/2 6 15 13 10 3 17 21 8 5 19 2 23 16 24 7 18 1 12 20 0 4 14 9 11 22 —

Table 1 may change, e.g., according to system requirements.

If the number of punctured bits is represented by N_(punc) and the number of elements in a group l(for 0≦l<s) is represented by N_(add) _(—) _(parity) ₁ , an index group of parity bits in a group l(for 1≦l<s) can be calculated using Equation (5) below.

$\begin{matrix} {{{C(l)} = \begin{Bmatrix} {A_{N_{punc} + N_{{add\_ parity}_{0}} + \ldots + N_{{add\_ parity}_{l - 1}}},\ldots \mspace{14mu},} \\ A_{N_{punc} + N_{{add\_ parity}_{0}} + \ldots + N_{{add\_ parity}_{l}} - 1} \end{Bmatrix}}{C(l)} = {{\begin{Bmatrix} {A_{N_{{punc} + {({N_{{group}_{0}} + \ldots + N_{{group}_{l_{1}}}})}}},} \\ {A_{N_{{punc} + {({N_{{group}_{0}} + \ldots + N_{{group}_{l_{1}}} + 1})}}},\ldots \mspace{14mu},} \\ A_{N_{{punc} + {({N_{{group}_{0}} + N_{{group}_{1}} - 1})}}} \end{Bmatrix}\mspace{14mu} 1} \leq l < s}} & (5) \end{matrix}$

That is, N_(add) _(—) _(parity) _(l) indexes of parity bits included in an l-th group of additional parity bits are sequentially selected, except for indexes corresponding to punctured parity bits in the puncturing pattern set A.

Alternatively, indexes of parity bits included in a group of additional parity bits may be selected in a reverse order of the puncturing pattern. In this case, an index group of parity bits in a group l can be calculated using Equation (6) below.

$\begin{matrix} {{{C(0)} = \left\{ {A_{N_{parity} - 1},A_{N_{parity} - 2},\ldots \mspace{14mu},A_{N_{parity} - N_{{add\_ parity}_{0}} - 1}} \right\}}{{C(l)} = \begin{Bmatrix} {A_{N_{parity} - {({N_{{add\_ parity}_{0}} + \ldots + N_{{add\_ parity}_{l - 1}}})}},} \\ {A_{N_{parity} - {({N_{{add\_ parity}_{0}} + \ldots + N_{{add\_ parity}_{l - 1}} - 1})}},\ldots \mspace{14mu},} \\ A_{N_{parity} - {({N_{{add\_ parity}_{0}} + \ldots + N_{{add\_ parity}_{1}} - 1})}} \end{Bmatrix}}{1 \leq l < s}} & (6) \end{matrix}$

In Equation (6), N_(parity)=N_(ldpc)−K_(ldpc) represents the number of parity bits.

That is, N_(add) _(—) _(parity) _(l) indexes of parity bits included in an l-th group of additional parity bits are selected in reverse order in the puncturing pattern set A indicative of puncturing order, starting with the last bit.

Based on the group of indexes calculated using Equation (5) or (6), elements in a group of parity bits transmitted over a plurality of frames can be expressed as shown in Equation (7) below.

G(l)={p _(k) |∀kεC(l)} for 0≦l<s  (7)

In Equation (7), p_(k) represents a k-th parity bit in the parity check matrix. Using Equation (7), the parity bits having values belonging to an l-th group C(l) of indexes calculated in Equation (6), are included in an l-th group C(l) of additional parity bits.

Accordingly, Equation (7) generates group satisfying Rule 3.

Rule 4

Additional parity bits are created based on parity bits and information bits by sequentially selecting parity bits and mapping them to groups G(0), G(1), . . . , G(s−1) in order. As for the information bits, information bits more likely to provide better performance are sequentially selected.

In creating additional parity bits according to Rule 4, an order of the additional parity bits to be created may also be determined from remaining bits, i.e., the non-punctured bits. However, after all the non-punctured bits are selected, the punctured bits may be selected.

In Rule 4, if additional parity bits should be selected, even after the punctured parity and non-punctured bits are all selected, bits more likely to provide better performance may be selected from information bits and parity bits using the greedy algorithm. The greedy algorithm is provided to select the best performance bits among codeword bits when primarily selecting additional parity bits, and select the best performance bits among the remaining bits, with the first selected bits fixed as previously selected bits, when secondarily selecting additional parity bits. The following should be considered in selecting high-performance bits.

1) Degrees of variable nodes corresponding to codeword bits

2) Minimum cycles of variable nodes corresponding to codeword bits

3) Bit Error Rate (BER) performance of codeword bits

In a parity check matrix with a parity part having a dual diagonal structure, because concatenated bits are connected to the same check nodes, there is a correlation between concatenated bits. Accordingly, it is preferable not to transmit the concatenated bits on the same channel. Thus, parity bits are mapped to different groups in sequence, in order to experience different channels.

Embodiment 3

FIG. 7 illustrates a frame structure based on Rule 4 according to an embodiment of the present invention.

Referring to FIG. 7, a codeword includes an information part and a parity part. Using the same example as above, a length of the information part, after undergoing shortening, is 7 bits, I={i₀, i₁, . . . , i₆}, the parity part is 8 bits in length, P={p₀, p₁, p₂, . . . , p₇}, and a puncturing pattern set representing puncturing order is A={1, 5, 2, 6, 4, 0, 3, 7}.

For N_(punc)=2, s=3, and N_(add) _(—) _(parity) ₀ =N_(add) _(—) _(parity) ₁ =N_(add) _(—) _(parity) ₂ =2 (where N_(punc) is the number of punctured bits, s is the number of frames on which additional parity bits are transmitted, and N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , and N_(add) _(—) _(parity) ₂ are the numbers of additional parity bits transmitted on their associated frames), groups of additional parity bits are created as described below. It is assumed that a parity check matrix corresponding to the parity part is a dual diagonal matrix in structure.

Because the number of punctured bits is 2, p₁ and p₅ are punctured according to the puncturing pattern set A.

Because parity bits are sequentially mapped to groups according to Rule 4, among the bits p₀, p₂, p₃, p₄, p₆, and p₇, i.e., the non-punctured parity bits, p₀ is mapped to a first group, p₂ to a second group, p₃ to a third group, p₄ to the first group, p₆ to the second group, and p₇ to the third group. As a result, the first group is G(0)={p₀, p₄}, the second group is G(1)={p₂, p₆}, and the third group is G(2)={p₃, p₇}. The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame. While the determined groups are sequentially transmitted, transmission order of the groups is subject to change.

Embodiment 4

Again, a length of the information part, after undergoing shortening, is 7 bits, I={i₀, i₁, . . . , i₆}, the parity part is 8 bits in length, P={p₀, p₁, p₂, . . . , p₇}, and a puncturing pattern set representing puncturing order is A={1, 5, 2, 6, 4, 0, 3, 7}.

For N_(punc)=2, s=3, and N_(add) _(—) _(parity) ₀ =N_(add) _(—) _(parity) ₁ =N_(add) _(—) _(parity) ₃ =3 (where N_(punc) is the number of punctured bits, s is the number of frames on which additional parity bits are transmitted, and N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , and N_(add) _(—) _(parity) ₂ are the numbers of additional parity bits transmitted on their associated frames), groups of additional parity bits are created as described below. It is assumed that a parity check matrix corresponding to the parity part is a dual diagonal matrix in structure.

Because the number of punctured bits is 2, p₁ and p₅ are punctured according to the puncturing pattern set A.

Because the number N_(add) _(—) _(parity) ₀ +N_(add) _(—) _(parity) ₁ +N_(add) _(—) _(parity) ₃ =9 of additional parity bits forming groups is greater than the number of parity bits, i.e., 8, bits included in the last group are selected from the information bits. That is, a first group is G(0)={p₀, p₄, p₁}, a second group is G(1)={p₂, p₆, p₅}, and a third group is G(2)={p₃, p₇, i₀}.

The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame. While the determined groups are sequentially transmitted, transmission order of the groups is subject to change.

A method for generating additional parity bits in accordance with another embodiment of the present invention will be described below.

By transmitting non-punctured parity bits and an information word on the same frame and transmitting additional parity bits on other frames to obtain an additional diversity gain, it is possible to obtain diversity gain while reducing the actual code rate.

For convenience of description, it is assumed herein that the term ‘codeword’ refers to all of an information word and parity bits obtained by encoding the information word. That is, the parity bits include both non-punctured parity bits and punctured parity bits.

Method 2

Non-punctured parity bits are transmitted on a z-th frame, which is the same frame as that of the information word, and additional parity bits obtained from information word and parity bits, which are included in groups G(0), G(1), . . . , G(s−1), according to specific rules, are transmitted over s frames.

The additional parity bits are bits that are transmitted on previous frames, instead of being transmitted on the same frame as that of the information words, aside from the parity bits that are transmitted on the same frames as those of the information words. G(0), G(1), . . . , G(s−1) represent groups of additional parity bits.

Rule 5

Additional parity bits are selected from parity bits and information bits, and the parity bits that are not transmitted on the same frames as the information bits are first selected. The parity bits that are not transmitted on the same frames the information bits are punctured parity bits. When additional parity bits are selected from parity bits, an order of selection of the additional parity bits is determined according to a normal order or a reverse order of a puncturing pattern. As to the information bits, information bits that are more likely to have a better performance are sequentially selected.

In creating additional parity bits according to Rule 5, parity bits that are not transmitted on the frames that information bits are transmitted, i.e., the punctured parity bits, are first selected as additional parity bits. After these parity bits that are all selected, information bits and parity bits from the codeword are selected as additional parity bits.

In Rule 5, if additional parity bits should be selected, after all of the punctured parity bits are selected all, bits that are more likely to provide better performance may be selected from the information bits and the parity bits of the codeword using the greedy algorithm. As described above, the greedy algorithm is provided to select the best performance bits among codeword bits when primarily selecting additional parity bits, and select the best performance bits among the remaining bits, with the first selected bits fixed as previously selected bits, when secondarily selecting additional parity bits, and considers the following in selecting high-performance bits.

1) Degrees of variable nodes corresponding to codeword bits

2) Minimum cycles of variable nodes corresponding to codeword bits

3) BER performance of codeword bits

Embodiment 5

FIGS. 8A to 8C illustrate frame structures based on Rule 5 according to an embodiment of the present invention.

Referring to FIG. 8A, a codeword includes an information part and a parity part. A length of the information part, after undergoing shortening, is 7 bits, I={i₀, i₁, . . . , i₆}, the parity part is 8 bits in length, P={p₀, p₁, p₂, . . . , p₇}, and a puncturing pattern set representing puncturing order is A={1, 5, 2, 6, 4, 0, 3, 7}.

If the number of parity bits transmitted on the same frames as those of information bits is 5, for N_(punc)=3, s=3, and N_(add) _(—) _(parity) ₀ =N_(add) _(—) _(parity) ₁ =N_(add) _(—) _(parity) ₂ =2 (where N_(punc) is the number of punctured bits, s is the number of frames on which additional parity bits are transmitted, and N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , and N_(add) _(—) _(parity) ₂ are the numbers of additional parity bits transmitted on their associated frames), groups of additional parity bits are created as described below.

Because N_(punc)=3, p₁, p₅, and p₂ are punctured, and parity bits transmitted on the same frames as those of information bits are p₀, p₃, p₄, p₆, and p₇.

In mapping bits to groups in a puncturing order according to Rule 5, a first group G(0)={p₁, p₅} is created by selecting parity bits p1 and p₅, which have first and second elements of 1 and 5 in the puncturing pattern as their index values. For a second group, a parity bit p₂ having a third element of 2 in the puncturing pattern as its index is selected. Because all of the punctured parity bits are selected, the second group is created by selecting one of the information bits and the non-punctured parity bits. If a first information bit is selected, the second group is G(1)={p₂, i₀}. If i₁ and i₂ are selected from among information bits and non-punctured parity bits to create a third group, the third group is G(2)={i₁, i₂}. The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame.

Referring to FIG. 8B, if bits are mapped to groups in a reverse order of the puncturing pattern, a first group G(0)={p₂, p₅}, a second group G(1)={p₁, i₀}, and a third group G(2)={i₁, i₂} are created by selecting bits from among the punctured parity bits {p₁, p₅, p₂} among elements in the puncturing pattern set A, starting with the last bit. The first group is transmitted on a (k+2)-th frame, the second group on a (k+1)-th frame, and the third group on a k-th frame.

Referring to FIG. 8C, to facilitate easy selection of parity bits transmitted on frames, parity bits are sequentially transmitted in a reverse order of the puncturing pattern, after undergoing permutation. That is, because the puncturing pattern is A={1, 5, 2, 6, 4, 0, 3, 7}, parity bits are arranged as p₇, p₃, p₀, p₄, p₆, p₂, p₅, and p₁ in reverse order of the puncturing pattern, and parity bits transmitted on the same frames as those of the information bits are p₇, p₃, p₀, p₄, and p₆, because five bits are sequentially selected from the arranged parity bits. Thus, for G(0), p₂ and p₅ are selected. For G(1), p₁ is selected and one bit is selected from the information bits. For G(2), two bits are selected from the information bits according to the greedy algorithm.

While the determined groups are sequentially transmitted, the transmission order of the groups is subject to change.

Embodiment 6

A length of the information part, after undergoing shortening, is 7 bits, I={i₀, i₁, . . . , i₆}, the parity part is 8 bits in length, P={p₀, p₁, p₂, . . . , p₇}, and a puncturing pattern set representing puncturing order is A={1, 5, 2, 6, 4, 0, 3, 7}.

For N_(punc)=3, s=3, and N_(add) _(—) _(parity) ₀ =N_(add) _(—) _(parity) ₁ =N_(add) _(—) _(parity) ₂ =4 (where N_(punc) is the number of punctured bits, s is the number of frames on which additional parity bits are transmitted, and N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , and N_(add) _(—) _(parity) ₂ are the numbers of additional parity bits transmitted on their associated frames), groups of additional parity bits are created as described below.

Because N_(punc)=3, p₁, p₅, and p₂ are punctured, and p₀, p₃, p₄, p₆, and p₇ are the parity bits transmitted on the same frames as those of information bits.

By mapping the remaining parity bits, i.e., the punctured parity bits, to groups in puncturing order according to Rule 5, a first group is G(0)={p₁, p₅, p₂, i₀}, a second group is G(1)={i₁, i₂, i₃ i₄} and a third group is G(2)={i₅, i₆, p₆, p₄}. In creating the third group G(2), because the parity bits are arranged as i₁, i₅, p₂, p₆, i₄ i₀, p₃, and p₇ according to the puncturing pattern, and among them, i₁, i₅, and p₂ were selected for the first group G(0), then p₆, and i₄ are selected for the third group G(2).

By mapping the punctured parity bits to groups in a reverse puncturing order, a first group is G(0)={p₂, p₅, p₁, i₀}, a second group is G(1)={i₁, i₂, i₃, i₄}, and a third group is G(2)={i₅, i₆, p₇, p₃}. In creating the third group G(2), because the parity bits are arranged as i₇, i₃, p₀, p₄, i₆, i₂, p₅, and p₁ in reverse order of the puncturing pattern, and among them, i₂, i₅, and p₁ were selected for the first group G(0), then p₇ and i₃, which are first and second parity bits among the parity bits arranged in reverse puncturing order, are selected for the third group G(2).

The first group is transmitted on a (k+2)-th frame, the second group is transmitted on a (k+1)-th frame, and the third group is transmitted on a k-th frame.

While the determined groups are sequentially transmitted, the transmission order of the groups is subject to change. In addition, various other methods for selecting information bits are available in different embodiments of the present invention.

A method for creating additional parity bits when encoding and decoding are performed based on the parity check matrixes used in Digital Video Broadcasting the 2nd Generation Satellite (DVB-S2), DVB-T2, Digital Video Broadcasting the 2nd Generation Cable (DVB-C2), and DVB-NGH systems will be described below.

In the following description, it is assumed that a code rate of a parity check matrix is R=4/9, the number of information bits is K_(ldpc)=7200, the number of codeword bits is N_(ldpc)=16200, and the number of parity bits is N_(parity)=N_(ldpc)−K_(ldpc)=9000.

As described above, for an information part of an LDPC code, blocks are generated on a 360-column basis. In a parity check matrix, a total of 20 column groups are generated by grouping 7200 columns corresponding to an information word on a 360-column basis. A parity part may express Q_(ldpc) groups, each of which includes 360 elements as shown in Equation (2) and represents indexes of parity bits. For a code rate R of 4/9, Q_(ldpc)=25. In addition, any of the puncturing patterns in Table 1 may be used.

For convenience of description, sets of indexes included in column groups of an information part can be expressed as shown in Equation (8) below.

$\begin{matrix} {{X(j)} = {{\left\{ {{{k\left\lbrack \frac{k}{360} \right\rbrack} = j},\mspace{14mu} {0 \leq k < K_{bch}}} \right\} \mspace{14mu} {for}\mspace{14mu} 0} \leq j < N_{info}}} & (8) \end{matrix}$

In Equation (8), [k/360] indicates an integer less than k/360. For example, if k/360=0.2, [0.2]=0, or if k/360=11.8, [11.8]=11. In addition, N_(info) indicates the number of column groups in the information part, and N_(info)=20 for R=4/9. Additionally, K_(bch) indicates the number of information bits of a BCH code, when an LDPC code and a BCH code are used by being concatenated.

An order for creating optimal additional parity bits according to a length will be described below. The following description assumes that additional parity bits can be selected from parity bits in a reverse order of puncturing.

If the number of input information word is 7200, additional parity bits are first selected in a reverse order of puncturing, because puncturing and shortening are not required. That is, by selecting index values in the following order, information bits and parity bits corresponding to the index values are selected. In the following description, I(a) indicates a set of indexes of parity bits as defined in Equation (3), and X(a) indicates a set of indexes of information bits as defined in Equation (8). In other words, I(a) indicates that parity bits having elements of I(a) are selected as their indexes, and X(a) indicates that information bits having elements of X(a) are selected as their indexes.

I(11)→I(7)→I(19)→I(21)→I(0)→I(14)→I(1)→I(23)→I(16)→I(3)→I(12)→I(22)→I(10)→I(24)→I(2)→I(17)→I(5)→I(20)→I(15)→I(8)→I(13)→I(9)→I(18)→I(4)→I(6)

I(9)→I(26)→I(3)→I(15)→I(30)→I(13)→I(6)→I(19)→I(34)→I(16)→I(1)→I(23)→I(4)→I(17)→I(22)→I(24)→I(7)→I(11)→I(31)→I(10)→I(8)→I(2)→I(35)→I(28)→I(20)→I(18)→I(25)→I(33)→I(0)→I(21)→I(12)→I(5)→I(32)→I(29)→I(14)→I(27)

When more additional parity bits are required, bits are selected in the following order.

I(11)→I(7)→I(19)→I(21)→I(0)→I(14)→I(1)→I(23)→I(16)→I(3)→I(12)→I(22)→I(10)→I(24)→I(2)→I(17)→I(5)→I(20)→I(15)→I(8)→I(13)→I(9)→I(18)→I(4)→I(6)→X(5)→X(6)→X(7)→X(8)→X(9)→X(10)→X(11)→X(12)→X(13)→X(14)→X(15)→X(16)→X(17)→X(18)→X(19)→X(0)→X(1)→X(2)→X(3)→X(4)

X(4)→X(5)→I(9)→I(26)→X(6)→X(7)→X(8)→I(3)→I(15)→I(30)→I(13)→I(6)→I(19)→I(34)→I(16)→I(1)→I(23)→I(4)→I(17)→I(22)→I(24)→I(7)→I(11)→I(31)→I(10)→I(8)→I(2)→I(35)→I(28)→I(20)→I(18)→I(25)→I(33)→I(0)→I(21)→I(12)→I(5)→I(32)→I(29)→I(14)→I(27)

Thereafter, if even more additional parity bits are required, both of the above transmission orders are repeated in the same way.

As another example, if the number of input information word is 3600, 10 information bocks undergo shortening and 12 parity blocks undergo puncturing. As a result, the number of non-punctured blocks is 25−12=13, and non-punctured blocks are first selected in the following order.

I(11)→I(7)→I(19)→I(21)→I(0)→I(14)→I(1)→I(23)→I(16)→I(3)→I(12)→I(22)→(10)

I(9)→I(26)→I(3)→I(15)→I(30)→I(13)→I(6)→I(19)→I(34)→I(16)→I(1)→I(23)→I(4)→I(17)→I(22)→I(24)→I(7)→I(11)→I(31)→I(10)→I(8)→I(2)→I(35)→I(28)→I(20)→I(18)→I(25)→I(33)→I(0)

If more additional parity bits are required, bits are selected in the following order.

X(5)→X(6)→X(7)→X(8)→X(9)→X(19)→X(0)→X(1)→I(11)→I(7)→X(2)→X(3)→I(19)→I(21)→I(0)→I(14)→I(1)→I(23)→I(16)→I(3)→I(12)→I(22)→I(10)→I(24)→I(2)→I(17)→I(5)→I(20)→I(15)→I(8)→I(13)→I(9)→I(18)→I(4)→I(6)

I(21)→I(12)→I(5)→I(32)→I(29)→I(14)→I(27)→X(4→X(5→X(6)→I(9)→X(8)→I(26)→I(3)→I(15)→I(30)→I(13)→I(6)→I(19)→X(4)→I(34)→I(16)→I(1)→I(23)→I(4)→I(17)→I(22)→I(24)→I(7)→X(5) I(11)→I(31)→I(10)→I(8)→X(6)→I(2)→I(35)→I(28)→I(20)→I(18)→I(25)→I(33)→I(0)→I(21)→I(12)→I(5)→I(32)→I(29)→I(14)→I(27)

Thereafter, if even more additional parity bits are required, bits are repeatedly transmitted starting with codeword bits.

As is apparent from the foregoing description, the order of selecting additional parity bits having an optimal performance may be difference according to the length of input information bits. However, if bits are selected as will be described below, optimal performance and optimal system efficiency may be achieved.

More specifically, because Method 1 does not transmit parity bits on the same frames as those of information bits, additional parity bits may be selected in the following order.

1) Non-punctured parity bits are selected in a normal order or a reverse order of the puncturing pattern.

2) If more additional parity bits are required, punctured parity bits are selected in the normal order or the reverse order of the puncturing pattern.

3) If more additional parity bits are still required, bits are selected starting with information bits with a degree of 3.

4) If even more additional parity bits are still required, parity bits are selected in the normal order or the reverse order of the puncturing pattern.

5) If more additional parity bits are required, information bits with a degree of 12 are selected.

6) If more additional parity bits are required, the procedure above is repeated from step 1).

In accordance with another embodiment of the present invention, additional parity bits may be selected in the following order.

1) Non-punctured parity bits are selected in a normal order or a reverse order of the puncturing pattern.

2) If more additional parity bits are required, punctured parity bits are selected in the normal order or the reverse order of the puncturing pattern.

3) If more additional parity bits are still required, bits are selected starting with information bits with a degree of 3.

4) If even more additional parity bits are still required, information bits with a degree of 12 are selected.

5) If more additional parity bits are required, parity bits are selected in the normal order or the reverse order of the puncturing pattern.

6) If more additional parity bits are required, the procedure above is repeated from step 1).

In accordance with another embodiment of the present invention, additional parity bits may be selected in the following order.

1) Non-punctured parity bits are selected in a normal order or a reverse order of the puncturing pattern.

2) If more additional parity bits are required, punctured parity bits are selected in the normal order or the reverse order of the puncturing pattern.

3) If more additional parity bits are still required, parity bits are selected in the normal order or the reverse order of the puncturing pattern.

4) If even more additional parity bits are still required, bits are selected starting with information bits with a degree of 12.

5) If more additional parity bits are required, information bits with a degree of 2 are selected.

6) If more additional parity bits are required, the procedure above is repeated from step 1).

Because Method 2, as described above, transmits parity bits on the same frames as those of information bits, non-punctured parity bits are transmitted on the same frames as those of information bits.

Therefore, in accordance with an embodiment of the present invention, additional parity bits are selected in the following order.

1) If additional parity bits are required, punctured parity bits are selected in a normal order or a reverse order of the puncturing pattern.

2) If more additional parity bits are required, bits are selected starting with information bits with a degree of 3.

3) If more additional parity bits are still required, parity bits are selected in the normal order or the reverse order of the puncturing pattern.

4) If even more additional parity bits are still required, information bits with a degree of 12 are selected.

5) If more additional parity bits are required, non-punctured parity bits are selected in the normal order or the reverse order of the puncturing pattern.

6) If more additional parity bits are required, the above is repeated from 1).

In accordance with another embodiment of the present invention, additional parity bits may be selected in the following order.

1) If additional parity bits are required, punctured parity bits are selected in a normal order or a reverse order of the puncturing pattern.

2) If more additional parity bits are required, bits are selected starting with information bits with a degree of 3.

3) If more additional parity bits are still required, information bits with a degree of 12 are selected.

4) If even more additional parity bits are still required, punctured parity bits and non-punctured parity bits are selected in the normal order or the reverse order of the puncturing pattern.

5) If more additional parity bits are required, the procedure above is repeated from step 1).

In accordance with another embodiment of the present invention, additional parity bits may be selected in the following order.

1) If additional parity bits are required, punctured parity bits are selected in a normal order or a reverse order of the puncturing pattern.

2) If more additional parity bits are required, parity bits are selected in the normal order or the reverse order of the puncturing pattern.

3) If more additional parity bits are still required, bits are selected starting with information bits with a degree of 3.

4) If even more additional parity bits are still required, information bits with a degree of 12 are selected.

5) If more additional parity bits are required, the procedure above is repeated from step 1).

While methods above have been described based on a code with a code rate of ½, among LDPC codes used in DVB-S2, DVB-T2, DVB-C2, and DVB-NGH systems, the same methods may be applied to other code rates.

FIG. 9 illustrates a frame structure of a DVB-T2/NGH system according to an embodiment of the present invention.

Referring to FIG. 9, the signaling information word used in the DVB-T2/NGH system includes a configurable information part and a dynamic information part. The configure information part includes information that remains unchanged for several frames, whereas the dynamic information part includes information that changes for each frame. It is important to receive the configure information part and the dynamic information part without error, because they include information about data of the current frame. For example, when a Cyclic Redundancy Check (CRC) error occurs, data information of the pertinent frame may not be received.

In the configure information part, because the same information is received over several frames, if the received information is stored, errors may be corrected by obtaining diversity gain using the stored information. However, because the dynamic information part, is not repeatedly transmitted, sufficient diversity gain may not be obtained and significant deterioration of error correction capability may occur.

Therefore, as illustrated in FIG. 9, additional parity bits are transmitted on a plurality of frames by applying Method 1, as described above, to the dynamic information part. That is, additional parity bits are created after encoding the dynamic information part by a specific method, and the additional parity bits are divided into a plurality of groups G(0), G(1), . . . , G(s−1) whose numbers of elements are N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , . . . , N_(add) _(—) _(parity) _(s-1) , and transmitted on s frames. While s=3 in FIG. 9, it is obvious that s can be determined at random. Bits in each group are transmitted on the same frame. Rules 3 and 4 may be applied to the method of dividing parity bits into a plurality of groups. While G(0), G(1), . . . , G(s−1) are sequentially mapped to frames in FIG. 9, the method of mapping groups to frames is subject to change.

An occurrence of an error in the signaling information may be detected through a CRC check. If an error is detected through the CRC check, G(0), G(1), . . . , G(s−1) are received and dynamic information undergoes additional decoding. After the decoding operation is performed, a CRC check on the signaling may be performed once again to determine whether or nor there is an error.

If an error occurs in additional parity bits in the signaling information parts, the CRC check error may continuously occur, even though dynamic information is recovered through the additional decoding. To resolve these problems, an additional CRC may be used in dynamic information.

FIG. 10 illustrates a frame structure in which an additional CRC is used for dynamic information. Specifically, FIG. 10 illustrates a frame structure of a DVB-T2/NGH system according to another embodiment of the present invention.

If dynamic information is transmitted on a (k+3)-th frame, a CRC for the dynamic information may be transmitted on one of the frames over which additional parity bits are transmitted. As illustrated in FIG. 10, the CRC is transmitted on a (k+2)-th frame. When the dynamic information is encoded in the above method, a CRC may be included or not included in the information word.

In the DVB-T2/NGH system, signaling information, including configurable information, dynamic information, an extension part, a CRC, and padding bits, is encoded as an information word.

In accordance with an embodiment of the present invention, when information is transmitted as illustrated in FIGS. 9 and 10, a transmitter performs additional encoding on the dynamic information, and a receiver performs an additional decoding process on the dynamic information, when a CRC error for the signaling information occurs. In addition, if puncturing and shortening patterns for encoding of dynamic information are different from puncturing and shortening patterns for signaling, an additional module may be required for encoding and decoding of the dynamic information.

Using the frame structures as illustrated in FIGS. 9 and 10, encoding and decoding is performed twice for the signaling information. That is, signaling is divided into two different types of information: one is configure (conf) information that does not vary every frame, and another is dynamic (dyn) information that varies every frame. These two types of information are input as one information word and encoded. Of them, only the dyn information is separately encoded, and its parity bits are transmitted in previous frames. Therefore, primarily, conf and dyn are input as an information word and encoded, and secondarily, dyn is input and encoded. However, by using Method 2, encoding may be performed only once, and because additional puncturing and shortening patterns are not required, the additional module may be minimized in the encoding and decoding process.

FIG. 11 illustrates a frame structure of a DVB-T2/NGH system according to another embodiment of the present invention. Specifically, FIG. 11 illustrates Method 2, as described above, applied to a DVB-T2/NGH system.

The configurable information and dynamic information are received and LDPC-encoded. Generally, because signaling is variable, it undergoes shortening and puncturing to be adaptively encoded according to the variable length.

In the NGH system, because configurable information and dynamic information are encoded independently, L1 signaling in FIG. 11 refers to all kinds of L1 signaling information, instead of being limited to the configurable and dynamic information.

Non-punctured parity bits are transmitted on a (k+3)-th frame, which is the same frame as that of the signaling bits of FIG. 11. Groups G(0), G(1), and G(2) of additional parity bits, which are calculated by Rule 5 and whose numbers of elements are N_(add) _(—) _(parity) ₀ , N_(add) _(—) _(parity) ₁ , and N_(add) _(—) _(parity) ₂ , are transmitted on a (k+2)-th frame, a (k+1)-th frame, and a k-th frame, respectively.

While the number of frames on which additional parity bits are transmitted is assumed to be 3 in FIG. 11, as mentioned above, other numbers of frames may be used. Also, positions of the groups G(0), G(1), and G(2) of additional parity bits are changeable. That is, the additional parity bits may be transmitted on P1/P2 symbols, or an auxiliary stream. Also, the additional parity bits may be transmitted using the general data stream.

While the additional parity bits are transmitted on a (k+2)-th frame, a (k+1)-th frame, and a k-th frame, i.e., subsequent frames, in the descriptions above, alternatively, the additional parity bits may be transmitted on s previous frames.

FIGS. 22A and 22B are diagrams illustrating various frame structures according to different embodiments of the present invention. Specifically, FIGS. 22A and 22B illustrate frames structures in which additional parity bits are transmitted on s previous frames.

FIG. 22A illustrates additional parity bits being transmitted on frames preceding concatenated frames. For example, in the DVB-NGH system, NGH frames are transmitted using Future Extension Frames (FEF) in DVB-T2. Accordingly, the various embodiments of the present invention are not limited to the transmission of additional parity bits on s concatenated frames, and may be applied to the transmission on s frames preceding the frames carrying information bits.

FIG. 22B illustrates that additional parity bits may be transmitted in other RF bands. That is, in accordance with an embodiment of the present invention, the additional parity bits are not limited to the frames transmitted in the same RF channel.

Signaling used in a DVB-T2 system is classified into two types: L1 pre-signaling and L1 post-signaling including a configurable part, a dynamic part, and an extension part. While Method 2 has been described based on L1 post-signaling of T2 type signaling in FIG. 2, it may be applied to L1 pre-signaling of another type, e.g., DVB-NGH.

As in Method 2, after signaling information is encoded, non-punctured parity bits are transmitted on the same frames as those of information bits, and additional parity bits including information bits and parity bits are transmitted on previous frames. For the additional parity bits, punctured parity bits are first selected, and these bits are selected in a normal order or a reverse order of the puncturing pattern.

(N_(ldpc)−K_(ldpc)) parity bits can be divided into Q_(ldpc) groups, and a j-th parity group P_(j) can be expressed as shown in Equation (9).

P _(j) ={p _(k) |k mod Q _(ldpc) =j, 0≦k<N _(ldpc) −K _(ldpc)} for 0≦j<Q _(ldpc)  (9)

Using Equation (10) below, Q_(ldpc) can be calculated based on M, N_(ldpc) and K_(ldpc) as illustrated in FIG. 3.

Q _(ldpc)=(N _(ldpc) −K _(ldpc))/M  (10

In Equation (10), parity bits are divided into Q_(ldpc) groups, and each group includes M bits.

For a given number N_(punc) of punctured bits, punctured parity bits may be calculated as described below in Steps 1-3.

Step 1: The number N_(punc) _(—) _(group) of groups whose all parity bits are punctured can be calculated using Equation (11) below, wherein an operator └a┘ indicates a maximum integer not exceeding a. For example, └1.1┘=1, and └4.5┘=4.

$\begin{matrix} {N_{{punc}\_ {group}} = {{\left\lfloor \frac{N_{punc}}{M} \right\rfloor \mspace{14mu} {for}\mspace{14mu} 0} \leq N_{punc} < {N_{ldpc} - K_{ldpc}}}} & (11) \end{matrix}$

Step 2: For N_(punc) _(—) _(group) parity bit groups

P_(π_(p)(0)), P_(π_(p)(1)), …  , P_(π_(p)(N_(punc_group) − 1)),

all parity bits in the groups are punctured. π_(p)(j), which represents an index of a parity group, also indicates a puncturing order, e.g., as defined in Table 1. For example, in BPSK modulation, since π_(p)(0) is 6, parity bits in a parity bit group P_(π) _(p) ₍₀₎=P₆ are first punctured.

Step 3: For a group

P_(π_(p)(N_(punc_group))), (N_(punc) − M × N_(punc_group))

bits are punctured starting with first parity bits in the group. Non-punctured parity bits are transmitted on the same frames as those of the information bits.

Embodiment 7

A group G(0) of first additional parity bits is calculated as described below. For convenience of description, the description assumes that the method is performed starting with Step 4) below, after already performing Steps 1 to 3, described above.

Step 4: The number of parity bit groups whose all elements are selected to select additional parity bits, is calculated using Equation (12).

$\begin{matrix} {{N_{{{add}\_ {parity}}_{0}{\_ {group}}} = \left\lfloor \frac{N_{{{add}\_ {parity}}_{0}}}{M} \right\rfloor}\mspace{14mu}} & (12) \end{matrix}$

In Equation (12), N_(add) _(—) _(parity) ₀ indicates the number of first additional parity bits.

Step 5: For N_(add) _(—) _(parity) _(0—) _(group) parity bit groups

P_(π_(p)(0)), P_(π_(p)(1)), …  , P_(π_(p)(N_(add_parity₀_group) − 1)),

all parity bits in the groups are included in a group G(0) of first additional parity bits, and are transmitted on frames preceding the frame over which the information bits are transmitted. The preceding frames may be applied even in other RF channels as described above in connection with FIG. 22.

Step 6: For a group

P_(π_(p)(N_(add_parity₀_group))), (N_(add_parity₀) − M × N_(add_parity₀_group))

parity bits are included in a group G(0) of first additional parity bits, starting with first parity bits in the group.

There are several possible methods for determining order of bits in a group G(0) of first additional parity bits. For example, as illustrated in FIGS. 12A and 12C, bits are arranged in an order of a group P_(π) _(p) _((a))(0≦a<Q_(ldpc)) of parity bits in units of a group of P_(π) _(p) _((a)) of parity bits. Also, as illustrated in FIG. 12B, parity bits selected for G(0) may be arranged in an order of indexes of parity bits on a bit-by-bit basis.

Step 7: In a group

P_(π_(p)(N_(add_parity₀_group))),

the number of parity bits not included in the group G(0) of first additional parity bits may be calculated using Equation (13). Definitions of x and y are illustrated in FIGS. 12A to 12C.

y=min(M−(N _(add) _(—) _(parity) ₀ −M×N _(add) _(—) _(parity) _(0—) _(group)), N _(add) _(—) _(parity) ₁ )  (13)

Therefore, a group G(1) of second additional parity bits can be created starting with an (N_(add) _(—) _(parity) ₀ −M×N_(add) _(—) _(parity) _(0—) _(group))-th bit in a group

P_(π_(p)(N_(add_parity₀_group))).

The term “a-th bit” refers to a bit located in an a-th position when the first bit in a group

P_(π_(p)(N_(add_parity₀_group)))

is defined as a 0-th bit. In addition, min(a,b) represents a function of selecting one of a and b, which is the minimum value. For example, min(a,b)=a for a≦b, and min(a,b)=b for a>b.

Step 8: For N_(add) _(—) _(parity) ₁ >y, the number of parity bit groups whose all elements are selected to select second additional parity bits, is calculated using Equation (14) below.

$\begin{matrix} {{N_{{{add}\_ {parity}}_{1}{\_ {group}}} = \left\lfloor \frac{N_{{{add}\_ {parity}}_{1}} - y}{M} \right\rfloor}\mspace{14mu}} & (14) \end{matrix}$

Step 9: All parity bits in the groups

P_(π_(p)(N_(add_parity₀_group) + 1)), P_(π_(p)(N_(add_parity₀_group) + 2)), …  , P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₁_group)))

are included in a group of second additional parity bits.)

Step 10: In a group

P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₁_group) + 1)), (N_(add_parity₁) − y − M × N_(add_parity₁_group))

parity bits are created as second additional parity bits.

Step 11: In a group

P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₀_group) + 1)),

the number y of parity bits not included in the group G(1) of second additional parity bits can be calculated using Equation (15).

^(x=N)add_pardy₁ Y Mx N_(add-pardyi-group)

y=min(M−x,N _(add) _(—) _(parity) ₂ )  (15)

Therefore, y bits may be included in a group G(2) of third additional parity bits, starting with an x bit in the group

P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₀_group) + 1)).

Step 12: For N_(add) _(—) _(parity) ₂ >y, the number of parity bit groups whose elements are all selected to select third additional parity bits, is calculated using Equation (16).

$\begin{matrix} {{N_{{{add}\_ {parity}}_{2}{\_ {group}}} = \left\lfloor \frac{N_{{{add}\_ {parity}}_{2}} - y}{M} \right\rfloor}\mspace{14mu}} & (16) \end{matrix}$

Step 13: All parity bits in groups

P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₁_group) + 2)), P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₁_group) + 3)), …  , P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₁_group) + N_(add_parity₂_group) + 2))

are included in a group of third additional parity bits.

Step 14: In a group

P_(π_(p)(N_(add_parity₀_group) + N_(add_parity₁_group) + N_(add_parity₂_group) + 3)), (N_(add_parity₂) − y − M × N_(add_parity₂_group))

parity bits are created as third additional parity bits.

The method of determining an order of bits in a group G(1) of second additional parity bits is equal to the method of determining order of bits in a group G(0) of first additional parity bits.

Embodiment 8

A method of selecting additional parity bits in a reverse order of a puncturing pattern will be described below with reference to FIGS. 13A to 13C.

A method of calculating parity bits transmitted on the same frames as the information bits corresponds to Steps 1 to 3, as described above.

A group G(0) of first additional parity bits is calculated in the following method.

Step 4: The number y of bits selected for a group G(0) in a group

P_(π_(p)(N_(punc_group)))

can be calculated using Equation (17). (N

y=min(N _(punc) −M×N _(punc) _(—) _(group) ,N _(add) _(—) _(parity) ₀ )  (17)

Step 5: y bits are selected as first additional parity bits, starting with a first bit in a group

P_(π_(p)(N_(punc_group))).

If (N_(ldpc)−M×N_(punc) _(—) _(group)) bits are punctured starting with the last parity bit in the group

P_(π_(p)(N_(punc_group)))

and non-punctured bits are transmitted on the same frames as the information bits in Step 3, y bits are selected as first additional parity bits, starting with the last parity bit in a group

P_(π_(p)(N_(punc_group)))

in Step 5.

If N_(add) _(—) _(parity) ₀ is greater than y, the following Steps 6-8 are performed.

Step 6: The number of parity bit groups whose all bits are transmitted, is calculated using Equation (18).

$\begin{matrix} {{N_{{{add}\_ {parity}}_{0}{\_ {group}}} = \left\lfloor \frac{N_{{{add}\_ {parity}}_{0}} - y}{M} \right\rfloor}\mspace{14mu}} & (18) \end{matrix}$

Step 7: All parity bits in the N_(add) _(—) _(parity) _(0—) _(group) parity bit groups

P_(π_(p)(N_(punc_group))), P_(π_(p)(N_(punc_group) − 1)), …  , P_(π_(p)(N_(punc_group) − N_(add_parity₀_group) + 1))

are included in a group G(0) of first additional parity bits, and are transmitted on frames preceding the frames where the information bits are transmitted.

Step 8: (N_(add) _(—) _(parity) ₀ −M×N_(add) _(—) _(parity) _(0—) _(group)−y) parity bits are included in a group G(0) of first additional parity bits, starting with first parity bits in a group

P_(π_(p)(N_(punc_group) − N_(add_parity₀_group))).

There are several possible methods for determining an order of bits in a group G(0) of first additional parity bits. For example, as illustrated in FIGS. 13A and 13C, bits are arranged in reverse order of a group P_(π) _(p) _((a))(0≦a<Q_(ldpc)) of parity bits in units of the parity bit group P_(π) _(p) _((a)). Also, as illustrated in FIG. 13B, parity bits selected as additional parity bits may be arranged in an order of indexes of parity bits on a bit-by-bit basis.

A group G(1) of second additional parity bits is created by Steps 9-12.

Step 9: The number y of bits selected for a group G(1) in a group

P_(π_(p)(N_(punc_group) − N_(add_parity₀_group)))

is calculated using Equation (19).

x=N _(add) _(—) _(parity) ₀ −M×N _(add) _(—) _(parity) _(0—) _(group) −y

y=min(M−x,N _(add) _(—) _(parity) ₁ )  (19)

Step 10: y bits are selected starting with a first bit in a group

P_(π_(p)(N_(punc_group) − N_(add_parity₀_group))).

If N_(add) _(—) _(parity) ₁ is greater than y, the following process is performed.

Step 11: The number of parity bit groups whose all bits are transmitted, is calculated using Equation (20).

$\begin{matrix} {{N_{{{add}\_ {parity}}_{1} - {group}} = \left\lfloor \frac{N_{{{add}\_ {parity}}_{1}} - y}{M} \right\rfloor}\mspace{14mu}} & (20) \end{matrix}$

Step 12: All parity bits in the N_(add) _(—) _(parity) _(1—) _(group) parity bit groups

P_(π_(p)(N_(punc_group) − N_(add_parity₀_group) − 1)), P_(π_(p)(N_(punc_group) − N_(add_parity₀_group) − 2)), …  , P_(π_(p)(N_(punc_group) − N_(add_parity₀_group) − N_(add_parity₁_group)))

are included in a group G(1) of second additional parity bits, and are transmitted on frames preceding the frames in which the information bits are transmitted.

Step 13: (N_(add) _(—) _(parity) ₁ −M×N_(add) _(—) _(parity) _(1—) _(group)−y) parity bits are included in a group G(1) of second additional parity bits, starting with first parity bits in a group

P_(π_(p)(N_(punc_group) − N_(add_parity₀_group) − N_(add_parity₀_group) − 1).)

The method of determining order of bits in a group G(1) of second additional parity bits is equal to the method of determining order of bits in a group G(0) of first additional parity bits.

Embodiment 9

A method of more efficiently calculating additional parity bits by interleaving parity bits will be described below with reference to FIGS. 14A to 14D.

Parity bits p={p₁, p₁, . . . , p_(N) _(parity) } obtained by LDPC encoding are interleaved in accordance with Equation (21).

d _(M×t+s) =P _(Q) _(ldpc) _(×s+t) where M×Q _(ldpc) =N _(parity), 0≦s<M, 0≦t<Q _(ldpc) D _(j) ={d _(k) |j×M≦k<(j+1)×M} for 0≦j<Q _(ldpc)  (21)

The parity bit group is group-interleaved based on the π_(p)(j), and can be presented as shown in Equation (22).

If interleaved by Equation (21), an LDPC codeword constructed as illustrated in FIG. 14A is arranged in units of a plurality of parity bit groups P_(a)(0≦a<Q_(ldpc)), as illustrated in FIG. 14B.

Z _(i) =D _(π) _(p) _((Q) _(ldpc) _(−1−i))  (22)

The group interleaving, or group-by-group interleaving, means that bits in a group are equally interleaved, and bits in a group Z, are equal to bits of D_(π) _(p) _((Q) _(ldpc) _(−1−i)). The π_(p)(j), a value representing puncturing order, means the puncturing pattern for 0≦j<Q_(ldpc), which has been described in Table 1.

If interleaved by Equation (22), an LDPC codeword as illustrated in FIG. 14B is arranged such that a plurality of groups of parity bits are arranged in a reverse order of a puncturing pattern as in illustrated in FIG. 14C.

A method of calculating parity bits transmitted on the same frames as the information bits, is described below.

Step 1: The number N_(tx) _(—) _(group) of parity bit groups in which all parity bits are transmitted, can be calculated based on the number of punctured parity bits in accordance with Equation (23).

$\begin{matrix} {N_{{tx}\_ {group}} = {{\left\lfloor \frac{N_{parity} - N_{punc}}{M} \right\rfloor \mspace{14mu} {for}\mspace{14mu} 0} \leq N_{tx} < {N_{ldpc} - K_{ldpc}}}} & (23) \end{matrix}$

Step 2: All parity bits in the N_(tx) _(—) _(group) parity bit groups

Z₀, Z₁, …  , Z_(N_(tx_group − 1))

are transmitted.

Step 3: (N_(tx)−M×N_(tx) _(—) _(group)) bits are transmitted on the same frames as those of information bits, starting with first parity bits in a group

Z_(N_(punc_group)).

First additional parity bits are calculated using Steps 4-8.

Step 4: The number y of bits selected for a group G(0) in a group

Z_(N_(punc_group))

can be calculated in accordance with Equation (24).

y=min((N _(tx) −M×N _(tx) _(—) _(group)), N _(add) _(—) _(parity) ₀ )  (24)

Step 5: y bits are selected as first additional parity bits, starting with a first bit in a group

Z_(N_(punc_group)).

If N_(add) _(—) _(parity) ₀ is greater than y, Steps 6 and 7 are performed.

Step 6: The number of groups in which all bits are transmitted, is calculated using Equation (25).

$\begin{matrix} {{N_{{{add}\_ {parity}}_{0}{\_ {group}}} = \left\lfloor \frac{N_{{{add}\_ {parity}}_{0}} - y}{M} \right\rfloor}\mspace{14mu}} & (25) \end{matrix}$

Step 7: All parity bits in the N_(add) _(—) _(parity) _(0—) _(group) parity bit groups

Z_(N_(punc_group) + 1), …  , Z_(N_(punc_group) + N_(add_parity₀_group))

are included in a group G(0) of first additional parity bits and are transmitted on frames preceding the frames where the information bits are transmitted.

Step 8: (N_(add) _(—) _(parity) ₀ −M×N_(add) _(—) _(parity) _(0—) _(group)−y) parity bits are included in a group G(0) of first additional parity bits, starting with first parity bits in a group

Z_(N_(punc_group) + N_(add_parity₀_group) + 1).

The group of additional parity bits is constructed as illustrated in FIG. 14D.

A group G(1) of second additional parity bits is created using steps 9-13.

Step 9: The number y of bits selected for a group G(1) in a group

Z_(N_(punc_group) + N_(add_parity₀_group) + 1)

can be calculated using Equation (26).

x=N _(add) _(—) _(parity) ₀ −M×N _(add) _(—) _(parity) _(0—) _(group) −y

y=min(M−x,N _(add) _(—) _(parity) ₁ )  (26)

Step 10: y bits are selected starting with a first bit in a group

Z_(N_(punc_group) + N_(add_parity₀_group) + 1).

If N_(add) _(—) _(parity) ₁ is greater than y, Steps 11 to 13 are performed.

Step 11: The number of groups in which all bits are transmitted, is calculated using Equation (27).

$\begin{matrix} {{N_{{{add}\_ {parity}}_{1}{\_ {group}}} = \left\lfloor \frac{N_{{{add}\_ {parity}}_{1}} - y}{M} \right\rfloor}\mspace{14mu}} & (27) \end{matrix}$

Step 12: All parity bits in the N_(add) _(—) _(parity) _(1—) _(group) parity bit groups

Z_(N_(punc_group) + N_(add_parity₀_group) + 2),

Z_(N_(punc_group) + N_(add_parity₀_group) + 3), …  , Z_(N_(punc_group) + N_(add_parity₀_group) + 1 + N_(add_parity₁_group))

are included in a group G(1) of second additional parity bits, and are transmitted on frames preceding the frames in which the information bits are transmitted.

Step 13: (N_(add) _(—) _(parity) ₁ −M×N_(add) _(—) _(parity) _(1—) _(group)−y) parity bits are included in a group G(1) of second additional parity bits, starting with first parity bits in a group

Z_(N_(punc_group) + N_(add_parity₀_group) + N_(add_parity₁_group) + 2).

Group interleaving of Equation (22) can be expressed as shown in Equation (28).

z _(l×M+s) =d _(π) _(p) _((l)×M+s), 0≦l<Q _(ldpc), 0≦s<M  (28)

In this case, parity bits may be represented as z=z₀, z₁, z₂, . . . , z_(N) _(partiy) .

Therefore, parity bits, which are selected even when additional parity bits are not used, may be selected based on the value N_(tx) calculated in Equation (23), representing the number of parity bits transmitted on the same frames as those of the information bits, and on the additional parity bits N_(add) _(—) _(parity) ₀ , and N_(add) _(—) _(parity) ₁ .

Equation (29) represents a group {circumflex over (P)} of parity bits transmitted on the same frames as the information word, a group G(0) of first additional parity bits, and a group G(1) of second additional parity bits.

$\begin{matrix} {\mspace{20mu} {{\hat{P} = \left\{ {z_{0},z_{1},\ldots \mspace{14mu},z_{N_{tx} - 1}} \right\}}\mspace{20mu} {{G(0)} = \left\{ {z_{N_{tx}},z_{N_{tx} + 1},z_{N_{tx} + 2},\ldots \mspace{14mu},z_{N_{tx} + N_{{add\_ parity}_{0} - 1}}} \right\}}{{G(1)} = \begin{Bmatrix} {z_{N_{tx} + N_{{add\_ parity}_{0}}},z_{N_{tx} + N_{{add\_ parity}_{0}} + 1},z_{N_{tx} + N_{{add\_ parity}_{0}} + 2},\ldots \mspace{14mu},} \\ z_{N_{tx} + N_{{add\_ parity}_{0}} + N_{{add\_ parity}_{1} - 1}} \end{Bmatrix}}}} & (29) \end{matrix}$

If the total number N_(add) _(—) _(parity) ₀ + . . . +N_(add) _(—) _(parity) _(s-1) of additional parity bits is greater than N_(punc), N_(punc) additional parity bits are selected in accordance with Embodiments 7 and 8. More additional parity bits, which are required exceeding N_(punc), may be selected from the codeword, and the simplest way is to sequentially select the information word, parity bits transmitted in the same frames as those of the information word, and the selected additional parity bits, on a repeated basis, which is illustrated in FIG. 23 in brief.

Embodiment 10

A method of selecting additional parity bits in reverse order of a puncturing pattern is described below, wherein the total number N_(add) _(—) _(parity) ₀ + . . . +N_(add) _(—) _(parity) _(s-1) of additional parity bits is greater than N_(punc).

This method of calculating parity bits transmitted on the same frames as the information bits corresponds to Steps 1 to 3, as described above.

A group G(0) of first additional parity bits is calculated in Step 4.

Step 4: For N_(add) _(—) _(parity) ₀ >N_(punc), N_(punc) bits are selected for a group G(0), and N_(add) _(—) _(parity) ₀ −N_(punc) bits are selected from codeword bits, for the group G(0). A simple method is to sequentially select the codeword bits and additional parity bits on a repeated basis, as illustrated in FIG. 23.

For N_(add) _(—) _(parity) ₀ <N_(punc), Steps 4 to 8 of Embodiment 8 are performed in the same way.

A group G(1) of second additional parity bits is created in the following method.

Step 9: For N_(add) _(—) _(parity) ₀ >N_(punc) in Step 4, G(1) is selected from the codeword bits. The simplest way is to sequentially select the previously transmitted bits.

For N_(add) _(—) _(parity) ₀ <N_(punc) and N_(add) _(—) _(parity) ₀ +N_(add) _(—) _(parity) ₁ >N_(punc), G(1) is selected from the codeword bits. A simple method is to sequentially select the information bits, parity bits, and additional parity bits on a repeated basis, as illustrated in FIG. 23.

For N_(add) _(—) _(parity) ₀ +N_(add) _(—) _(parity) ₁ <N_(punc), Steps 9 to 13 of Embodiment 8 are performed in the same way.

FIG. 15 is a block diagram illustrating a transmission and reception apparatus according to an embodiment of the present invention.

Referring to FIG. 15, a transmitter 1500 includes an encoder 1502, a modulator 1504, and a framer 1506. A message u is encoded by the encoder 1502, modulated by the modulator 1504, and framed by the framer 1506 before being transmitted over a channel 1508. The transmitted signal is received at a receiver 1510 including a de-framer 1516, a demodulator 1514, and a decoder 1512. The received signal r is de-framed by a de-framer 1516 and a signal y is input to the demodulator 1514. The decoder 1512 calculates an estimate of a message from a signal z demodulated by the demodulator 1514.

The encoder 1502 generates parity bits by performing puncturing and shortening in a predetermined manner according to the size of the message.

FIG. 16 is a block diagram illustrating a transmission apparatus using a shortened LDPC code according to an embodiment of the present invention.

Referring to FIG. 16, the transmission apparatus includes an encoder 1602, a controller 1604, a puncturer 1606, an additional parity bit group generator 1608, and a framer 1610. Optionally, the transmission apparatus may include a shortening applying unit 1600.

The controller 1604 determines the number of bits that the shortening applying unit 1600 will shorten according to the length of an information word. The shortening applying unit 1600 inserts a bit having a value of 0 in a position corresponding to a shortened bit, or removes a column corresponding to a shortened bit from a parity check matrix of a given LDPC code. A method for determining the shortening pattern includes using a shortening pattern stored in a memory, generating a shortening pattern using a sequence generator (not shown), or obtaining a shortening pattern by using a density evolution analysis algorithm for a parity check matrix and a given information word length.

The LDPC encoder 1602 performs encoding based on an LDPC code shortened by the controller 1604 and the shortening applying unit 1600. In addition, puncturing is required, puncturing is applied to a generated LDPC codeword by the puncturer 1606. The number of and positions of bits the puncturer 1606 should puncture are determined by the controller 1604 according to a puncturing pattern. That is, knowing a puncturing pattern or puncturing order, the controller 1604 selects the bits to be punctured according to the puncturing order. The puncturing pattern may be stored in a memory, or may be generated using a sequence generator (not shown).

The additional parity bit group generator 1608 receives output data of the controller 1604 and the encoder 1602, and data from the puncturer 1606, and based thereon, generates additional parity bit groups in accordance with the above-described rules.

The framer 1610 generates frames corresponding to Methods 1 and 2, as described above.

FIG. 17 is a block diagram illustrating a reception apparatus using an LDPC code to which additional parity bit groups are applied, according to an embodiment of the present invention. Specifically, the example of the reception apparatus illustrated in FIG. 17 receives a signal transmitted from a communication system using the additional parity bit groups, and restores user-desired data from the received signal upon acquiring information about additional parity bits constituting the additional parity bit groups, from the received signal.

Referring to FIG. 17, the reception apparatus includes a controller 1700, a shortening/puncturing processor 1702, a demodulator 1704, an additional parity bit group processor 1706, and a decoder 1708. The demodulator 1704 receives and demodulates an LDPC code, reconstructs a frame by the controller 1700, and estimates an input value to the LDPC encoder in FIG. 16 based on the received signal. The demodulator 1704 delivers the demodulated signal to the shortening/puncturing processor 1702, the decoder 1708, and the additional parity bit group processor 1706.

The shortening/puncturing processor 1702, under control of the controller 1700, determines information about the shortened/punctured bits of an LDPC code based on the signal demodulated by the demodulator 1704, and delivers position information of the shortened/punctured bits to the decoder 1708.

The decoder 1708 restores user-desired data from the received signal using an output value of the demodulator 1704, and length information of the shortened/punctured code and position information of the shortened/punctured bits, received from the shortening/puncturing processor 1702. The decoder 1708 performs decoding by receiving position information of additional parity bits and a demodulation value from the additional parity bit group processor 1706.

The additional parity bit group processor 1706, under control of the controller 1700, processes position information of additional parity bits and demodulated data, and delivers the processed data to the decoder 1708. Processing demodulated data may vary in meaning. For example, values demodulated when the same bits are received several times, may be added.

FIG. 18 is a block diagram illustrating a transmission apparatus using a shortened LDPC code according to an embodiment of the present invention.

Referring to FIG. 18, the transmission apparatus includes an encoder 1802, a controller 1804, a puncturer 1806, an additional parity bit group generator 1808, a framer 1810, and a parity interleaver 1812. Optionally, the transmission apparatus may include a shortening applying unit 1800.

The controller 1804 determines the number of bits that the shortening applying unit 1800 will shorten, according to the length of an information word. The shortening applying unit 1800 inserts a bit having a value of 0 in a position corresponding to a shortened bit, or removes a column corresponding to a shortened bit from a parity check matrix of a given LDPC code. A method for determining the shortening pattern includes using a shortening pattern stored in a memory, generating a shortening pattern using a sequence generator (not shown), or obtaining a shortening pattern by using a density evolution analysis algorithm for a parity check matrix and a given information word length.

The encoder 1802 performs encoding based on an LDPC code shortened by the controller 1804 and the shortening applying unit 1800. Output values of the encoder 1802 are parity-interleaved by the parity interleaver 1812 on a group basis or on a bit basis, as described above in Embodiment 9.

As described above, the parity interleaver 1812 performs interleaving according to a puncturing pattern under control of the controller 1808. In addition, if puncturing is required, puncturing is applied to a generated LDPC codeword by the puncturer 1806. The number of and positions of bits the puncturer 1806 should puncture are determined by the controller 1804 according to a puncturing pattern. That is, knowing the puncturing pattern (or a puncturing order), the controller 1804 selects the bits punctured according to the puncturing pattern. The puncturing pattern may be stored in a memory, or may be generated using a sequence generator (not shown).

The additional parity bit group generator 1808 receives output data of the controller 1804 and the encoder 1802, and data from the puncturer 1806, and based thereon, generates additional parity bit groups in accordance with the above-described rules.

The framer 1810 generates frames corresponding to Methods 1 and 2, as described above.

FIG. 19 is a block diagram illustrating a reception apparatus using an LDPC code to which additional parity bit groups are applied, according to an embodiment of the present invention. Specifically, the example of the reception apparatus illustrated in FIG. 19 receives a signal transmitted from a communication system using the additional parity bit groups, and restores user-desired data from the received signal upon acquiring information about additional parity bits constituting the additional parity bit groups, from the received signal.

Referring to FIG. 19, the reception apparatus includes a controller 1900, a shortening/puncturing processor 1902, a demodulator 1904, an additional parity bit group processor 1906, a decoder 1908, and a parity deinterleaver 1910. The demodulator 1904 receives and demodulates an LDPC code, and delivers the demodulated signal to the shortening/puncturing processor 1902, the decoder 1908, and the additional parity bit group processor 1906.

The shortening/puncturing processor 1902, under control of the controller 1900, acquires information about shortened/punctured bits of an LDPC code from the signal demodulated by the demodulator 1904, and delivers the position information of the shortened/punctured bits to the decoder 1908.

The parity deinterleaver 1910, which corresponds to the parity interleaver 1812 illustrated in FIG. 18, reconstructs parity bits using an output value of the demodulator 1904, and length information of the shortened/punctured code and position information of the shortened/punctured bits, received from the shortening/puncturing processor 1902, and performs parity deinterleaving thereon.

The decoder 1908 restores user-desired data from the received signal using an output value of the parity deinterleaver 1910, and length information of a shortened/punctured code and position information of the shortened/punctured bits, received from the shortening/puncturing processor 1902. The decoder 1908 receives position information of additional parity bits and a demodulation value from the additional parity bit group processor 1906, and performs decoding thereon.

The additional parity bit group processor 1906, under control of the controller 1900, processes position information of the additional parity bits and the demodulated data, and delivers the processed data to the decoder 1908. Processing demodulated data may vary in meaning. For example, values demodulated when the same bits are received several times, may be added.

FIG. 20 is a flowchart illustrating a transmission method according to an embodiment of the present invention.

Referring to FIG. 20, in step 2000, the controller 1604 (or 1804) determines the number of bits for puncturing and shortening, the number of frames for carrying parity bits, and the number of bits and groups transmitted on each frame, in accordance with the above-described methods and rules.

In step 2002, the shortening applying unit 1600 (or 1800) performs shortening as needed. In step 2004, the encoder 1602 (or 1802) performs LDPC encoding using the determined parameters. In step 2006, the puncturer 1606 (or 1806) shortens/punctures the encoded bits. In step 2008, the additional parity bit group generator 1608 (or 1808) generates a plurality of additional parity bit groups using the codeword bits and parity bits in accordance with Rules 3 to 5. Step 2008 may also include a parity interleaving process. In step 2010, the framer 1610 (or 1810) transmits the codeword and the additional parity bit groups on a plurality of frames in accordance with the various methods according to the above-described embodiments of the present invention.

FIG. 21 is a flowchart illustrating a reception operation of a reception apparatus according to an embodiment of the present invention.

Referring to FIG. 21, in step 2100, the reception apparatus receives a code. In step 2102, the demodulator 1704 (or 1904) demodulates the received signal. Thereafter, in step 2104, the shortening/puncturing processor 1702 (or 1902) performs shortening/puncturing on the demodulated signal.

If there are no shortened/punctured bits, the decoder 1708 (or 1908) performs decoding in step 2108, skipping step 2106. However, if there are shortened/punctured bits, the shortening/puncturing processor 1702 (or 1902) delivers position information of shortened/punctured bits to the decoder 1708 (or 1908) and the additional parity bit group processor 1706 (or 1906) delivers position information of the additional parity bits to the decoder 1708 (or 1908), in step 2106.

In step 2108, considering that a probability that values of the shortened bits will be 0 is 1, based on the position information of the shortened/punctured bits, the decoder 1708 (or 1908) performs LDPC decoding, after determining that the punctured bits are erased bits.

As is apparent from the foregoing description, according to the above-described embodiments of the present invention, additional diversity gain may be obtained by transmitting parity bits over a plurality of frames.

In addition, by transmitting additional parity bits on a plurality of frames, the various embodiments of the present invention minimize for the use of an additional module in an encoding/decoding process, while increasing diversity gain.

While the present invention has been shown and described with reference to certain embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention as defined by the appended claims and their equivalents. 

1. A method for transmitting data in a communication system, comprising: transmitting an information word included in a codeword in a (k+s)-th frame; generating s groups based on parity bits obtained by encoding the information word; and transmitting the s groups in s frames preceding the (k+s)-th frame in a distributed manner.
 2. The method of claim 1, wherein generating the s groups comprises: puncturing the parity bits according to a predetermined puncturing pattern; and selecting non-punctured parity bits from among the parity bits, in a sequence based on the puncturing pattern.
 3. The method of claim 2, wherein among the non-punctured parity bits, concatenated bits in the predetermined puncturing pattern are mapped to a same group among the s groups.
 4. The method of claim 2, wherein generating the s groups further comprises selecting the punctured parity bits in a sequence based on the puncturing pattern, after selecting all of the non-punctured parity bits.
 5. The method of claim 4, wherein generating the s groups further comprises sequentially selecting bits of the codeword, after selecting all of the parity bits, when a total number of bits forming the groups is greater than a number of the parity bits.
 6. The method of claim 2, wherein generating the s groups further comprises sequentially mapping the non-punctured parity bits according to the predetermined puncturing pattern to the s groups.
 7. The method of claim 6, wherein among the non-punctured parity bits, concatenated bits are mapped to different groups among the s groups.
 8. The method of claim 7, wherein the parity bits are dual diagonal in structure.
 9. The method of claim 6, wherein generating the s groups further comprises selecting the parity bits punctured according to the puncturing pattern, after selecting all of the non-punctured parity bits.
 10. The method of claim 9, wherein generating the s groups further comprises selecting bits of the codeword after selecting all of the parity bits, if a total number of bits forming the groups is greater than a number of the parity bits.
 11. A method for transmitting data in a communication system, comprising: transmitting, on a (k+s)-th frame, an information word included in a codeword and non-punctured parity bits from among parity bits punctured according to a predetermined puncturing pattern, the parity bits obtained by encoding the information word; generating s groups by selecting punctured parity bits in sequence based on the predetermined puncturing pattern; and transmitting the s groups in s frames preceding the (k+s)-th frame in a distributed manner.
 12. The method of claim 11, wherein generating the s groups comprises selecting bits of the codeword, after selecting all of the punctured parity bits.
 13. The method of claim 12, wherein generating the s groups comprises selecting bits of the information word among bits of the codeword, after selecting all of the punctured parity bits.
 14. The method of claim 13, wherein generating the s groups further comprises selecting the non-punctured parity bits in a sequence based on the puncturing pattern, after selecting all of the information bits.
 15. The method of claim 11, wherein parity bits adjacent to each other in the predetermined puncturing pattern are mapped to a same group among the s groups.
 16. An apparatus for transmitting data in a communication system, comprising: an encoder for encoding an information word; a puncturer for puncturing a codeword encoded by the encoder according to a predetermined puncturing pattern; a parity group generator for generating s groups by selecting parity bits punctured by the puncturer from the codeword output from the encoder; and a transmitter for transmitting an information word included in the codeword in a (k+s)-th frame, and transmitting groups of the parity bits in s frames preceding the (k+s)-th frame, in a distributed manner.
 17. The apparatus of claim 16, wherein the parity group generator maps non-punctured parity bits among the parity bits, to the s groups in a sequence based on the predetermined puncturing pattern.
 18. The apparatus of claim 17, wherein the parity group generator maps concatenated bits in the predetermined puncturing pattern among the non-punctured bits to a same group among the s groups.
 19. The apparatus of claim 17, wherein the parity group generator generates the s groups by sequentially selecting the bits punctured according to the puncturing pattern, after selecting all of the non-punctured parity bits.
 20. The apparatus of claim 19, wherein the parity group generator generates the s groups by sequentially selecting bits of the codeword, after selecting all of the parity bits, if a total number of bits forming the s groups is greater than a number of the parity bits.
 21. The apparatus of claim 16, wherein the parity group generator sequentially maps non-punctured parity bits from among the parity bits, to the s groups.
 22. The apparatus of claim 21, wherein the parity group generator maps concatenated bits among the non-punctured parity bits to different groups.
 23. The apparatus of claim 22, wherein the parity bits are dual diagonal in structure.
 24. The apparatus of claim 21, wherein the parity group generator generates the s groups by selecting the punctured parity bits, after selecting all of the non-punctured parity bits.
 25. The apparatus of claim 24, wherein the parity group generator generates the s groups by selecting bits of the codeword, after selecting all of the parity bits, if a total number of bits forming the groups is greater than a number of the parity bits.
 26. The apparatus of claim 16, wherein the transmitter transmits the information word and non-punctured parity bits from among the parity bits, on a (k+s) frame.
 27. The apparatus of claim 26, wherein the parity group generator generates the s groups by selecting the punctured parity bits in a sequence based on the predetermined puncturing pattern.
 28. The apparatus of claim 27, wherein the parity group generator generates the s groups by selecting bits of the codeword, after selecting all of the punctured parity bits.
 29. The apparatus of claim 27, wherein the parity group generator generates the s groups by selecting bits of the information word among codeword, after selecting all of the punctured parity bits.
 30. The apparatus of claim 29, wherein the parity group generator generates the s groups by sequentially selecting the non-punctured parity bits, after selecting all of the information bits.
 31. The apparatus of claim 27, wherein the parity group generator maps parity bits adjacent to each other in the puncturing pattern to a same group among the s groups. 